Sequential Transmission Over Binary Asymmetric Channels With Feedback
نویسندگان
چکیده
In this paper, we consider variable-length coding over the memoryless binary asymmetric channel (BAC) with full noiseless feedback, including symmetric (BSC) as a special case. 2012, Naghshvar et al. introduced scheme, which refer to small-enough-difference (SED) scheme. For binary-input channels, deterministic feedback (VLF) code constructed SED scheme asymptotically achieves both capacity and Burnashev’s optimal error exponent. Building on work of al., paper extends BAC develops non-asymptotic VLF achievability bound that is shown achieve specific case BSC, develop an additional using two-phase analysis leverages submartingale synthesis Markov chain time first passage analysis. Numerical evaluations show new bounds outperform Polyanskiy’s for stop-feedback codes.
منابع مشابه
Optimal sequential transmission over broadcast channel with nested feedback
We consider the optimal design of sequential transmission over broadcast channel with nested feedback. Nested feedback means that the channel output of the outer channel is also available at the decoder of the inner channel. We model the communication system as a decentralized team with three decisionmakers—the encoder and the two decoders. Structure of encoding and decoding strategies that min...
متن کاملRobust Video Transmission over Binary Symmetric Channels with Packet Erasures
A video transmission system is presented based on the 3-D SPIHT algorithm for video compression and turbo codes for channel error protection. The channel considered is a binary symmetric channel with packet erasures, used for modeling the concatenation of a congested wired link followed by a noisy wireless hop. Unequal error protection with turbo codes is used for providing strong channel prote...
متن کاملSequential Relevance Maximization with Binary Feedback
Motivated by online settings where users can provide explicit feedback about the relevance of products that are sequentially presented to them, we look at the recommendation process as a problem of dynamically optimizing this relevance feedback. Such an algorithm optimizes the fine tradeoff between presenting the products that are most likely to be relevant, and learning the preferences of the ...
متن کاملSequential Transmission of Markov Sources over Burst Erasure Channels
We study the sequential coding of a Markov source process under error propagation and decoding delay constraints. The source sequence at each time is sampled i.i.d. along the spatial dimension and from a first order Markov process along the temporal dimension. The channel can introduce a single erasure burst of maximum length B starting at any arbitrary time. The encoder must operate in a causa...
متن کاملImage Communication over Noisy Channels with Feedback
When a feedback channel is available from the receiver to the transmitter, adaptive schemes for source-channel coding can be used for image transmission. In this paper we see that the use of embedded source codes and embedded channel codes, when combined in a Hybrid ARQ protocol, can provide the desired exibility at high eeciency, low complexity and low feedback channel usage. We propose optimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2022.3179656